Multifold factorizations of cyclic groups into subsets

Let $(G,+)$ be an abelian group. A finite multiset A over G is said to give a λ-fold factorization of G if there exists a multiset B over G such that each element of G occurs λ times in the multiset $A+B:=\{a+b:a\in A,b\in B\}$. In this article, restricting G to a cyclic group, we will provide sufficient conditions on a given multiset A under which the exact value or an upper bound of the minimum multiplicity λ of a factorization of G can be given by introducing a concept of ‘lcm-closure’. Furthermore, a couple of properties on a given factor A will be shown when A has a prime or prime power order (cardinality). A relation to multifold factorizations of the set of integers will be also glanced at a general perspective.     

Central Schur rings over the projective special linear groups

In [1 Bannai, E. (1991). Subschemes of some association schemes. J. Algebra 14:167–188.[Crossref], [Web of Science ®] , [Google Scholar]], Bannai presents a fusion condition and uses this to consider central Schur rings (S-rings) over the simple groups PSL(2,q) where q is a prime power. In this paper, we concretely describe all such S-rings in terms of symmetric S-rings over cyclic groups. The final section discusses counting these.     

An analysis on the efficiency of Euler's method for computing the matrix pth root

It is shown that the matrix sequence generated by Euler's method starting from the identity matrix converges to the principal pth root of a square matrix, if all the eigenvalues of the matrix are in a region including the one for Newton's method given by Guo in 2010. The convergence is cubic if the matrix is invertible. A modification version of Euler's method using the Schur decomposition is developed. Numerical experiments show that the modified algorithm has the overall good numerical behavior.     

Capable Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field

In this paper, we classify all capable nilpotent Lie algebras with the derived subalgebra of dimension 2 over an arbitrary field. Moreover, the explicit structure of such Lie algebras of class 3 is given.     

Unital affine semigroups

Affine semigroups are convex sets on which there exists an associative binary operation which is affine separately in either variable. They were introduced by Cohen and Collins in 1959. We look at examples of affine semigroups which are of interest to matrix and operator theory and we prove some new results on the extreme points and the absorbing elements of certain types of affine semigroups. Most notably we improve a result of Wendel that every invertible element in a compact affine semigroup is extreme by extending this result to linearly bounded affine semigroups.     

Schur Orthogonality Relations for the Finitary Infinite Symmetric Group

Let S f be the finitary infinite symmetric group. For a certain class of irreducible unitary representations of S f , a version of Schur orthogonality relations is proved. That is, we construct an invariant inner product on the matrix coefficient space of each representation and show that matrix coefficients for distinct representations are orthogonal with respect to these norms.     

Robust multilevel methods for quadratic finite element anisotropic elliptic problems

This paper discusses a class of multilevel preconditioners based on approximate block factorization for conforming finite element methods employing quadratic trial and test functions. The main focus is on diffusion problems governed by a scalar elliptic partial differential equation with a strongly anisotropic coefficient tensor. The proposed method provides a high robustness with respect to non‐grid‐aligned anisotropy, which is achieved by the interaction of the following components: (i) an additive Schur complement approximation to construct the coarse‐grid operator; (ii) a global block (Jacobi or Gauss–Seidel) smoother complementing the coarse‐grid correction based on (i); and (iii) utilization of an augmented coarse grid, which enhances the efficiency of the interplay between (i) and (ii). The performed analysis indicates the high robustness of the resulting two‐level method. Moreover, numerical tests with a nonlinear algebraic multilevel iteration method demonstrate that the presented two‐level method can be applied successfully in the recursive construction of uniform multilevel preconditioners of optimal or nearly optimal order of computational complexity. Copyright © 2013 John Wiley & Sons, Ltd.